A Label Correcting Algorithm with Storing Partial Solutions to Solving the Bus Routing Problem
نویسندگان
چکیده
منابع مشابه
A Label Correcting Algorithm with Storing Partial Solutions to Solving the Bus Routing Problem
In the paper we describe the bus routing problem (BRP), which the goal is to find a route from the start stop to the final stop minimizing the time and the cost of travel and the length of the route. Additionally the time of starting travel at the start stop is given. Analysis of the problem is presented and in particular we point at properties of routes. The BRP is an example of multicriteria ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کاملAn iterative school decomposition algorithm for solving the multi-school bus routing and scheduling problem
Servicing the school transportation demand safely with a minimum number of buses is one of the highest financial goals for school transportation directors. To achieve that objective, a good and efficient way to solve the routing and scheduling problem is required. Due to the growth of the computing power, the spotlight has been shed on solving the combined problem of the school bus routing and ...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatica
سال: 2013
ISSN: 0868-4952,1822-8844
DOI: 10.15388/informatica.2013.406